(0) Obligation:
Clauses:
shuffle(A, [], A) :- !.
shuffle([], B, B) :- !.
shuffle(.(A, RestA), B, .(A, Shuffled)) :- shuffle(RestA, B, Shuffled).
shuffle(A, .(B, RestB), .(B, Shuffled)) :- shuffle(A, RestB, Shuffled).
Query: shuffle(g,g,a)
(1) PrologToDTProblemTransformerProof (SOUND transformation)
Built DT problem from termination graph DT10.
(2) Obligation:
Triples:
shuffleA(.(X1, []), .(X2, X3), .(X2, X4)) :- shuffleA(.(X1, []), X3, X4).
shuffleA(.(X1, .(X2, X3)), X4, .(X1, .(X2, X5))) :- shuffleA(X3, X4, X5).
shuffleA(.(X1, X2), .(X3, X4), .(X1, .(X3, X5))) :- shuffleA(X2, X4, X5).
shuffleA(.(X1, X2), .(X3, X4), .(X3, X5)) :- shuffleA(.(X1, X2), X4, X5).
shuffleA(.(X1, X2), .(X3, X4), .(X3, .(X1, X5))) :- shuffleA(X2, X4, X5).
shuffleA(X1, .(X2, .(X3, X4)), .(X2, .(X3, X5))) :- shuffleA(X1, X4, X5).
Clauses:
shufflecA(X1, [], X1).
shufflecA([], X1, X1).
shufflecA(.(X1, X2), [], .(X1, X2)).
shufflecA(.(X1, []), X2, .(X1, X2)).
shufflecA(.(X1, []), .(X2, X3), .(X2, X4)) :- shufflecA(.(X1, []), X3, X4).
shufflecA(.(X1, .(X2, X3)), X4, .(X1, .(X2, X5))) :- shufflecA(X3, X4, X5).
shufflecA(.(X1, X2), .(X3, X4), .(X1, .(X3, X5))) :- shufflecA(X2, X4, X5).
shufflecA(.(X1, X2), .(X3, X4), .(X3, X5)) :- shufflecA(.(X1, X2), X4, X5).
shufflecA(X1, .(X2, []), .(X2, X1)).
shufflecA([], .(X1, X2), .(X1, X2)).
shufflecA(.(X1, X2), .(X3, X4), .(X3, .(X1, X5))) :- shufflecA(X2, X4, X5).
shufflecA(X1, .(X2, .(X3, X4)), .(X2, .(X3, X5))) :- shufflecA(X1, X4, X5).
Afs:
shuffleA(x1, x2, x3) = shuffleA(x1, x2)
(3) TriplesToPiDPProof (SOUND transformation)
We use the technique of [DT09]. With regard to the inferred argument filtering the predicates were used in the following modes:
shuffleA_in: (b,b,f)
Transforming
TRIPLES into the following
Term Rewriting System:
Pi DP problem:
The TRS P consists of the following rules:
SHUFFLEA_IN_GGA(.(X1, []), .(X2, X3), .(X2, X4)) → U1_GGA(X1, X2, X3, X4, shuffleA_in_gga(.(X1, []), X3, X4))
SHUFFLEA_IN_GGA(.(X1, []), .(X2, X3), .(X2, X4)) → SHUFFLEA_IN_GGA(.(X1, []), X3, X4)
SHUFFLEA_IN_GGA(.(X1, .(X2, X3)), X4, .(X1, .(X2, X5))) → U2_GGA(X1, X2, X3, X4, X5, shuffleA_in_gga(X3, X4, X5))
SHUFFLEA_IN_GGA(.(X1, .(X2, X3)), X4, .(X1, .(X2, X5))) → SHUFFLEA_IN_GGA(X3, X4, X5)
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X1, .(X3, X5))) → U3_GGA(X1, X2, X3, X4, X5, shuffleA_in_gga(X2, X4, X5))
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X1, .(X3, X5))) → SHUFFLEA_IN_GGA(X2, X4, X5)
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → U4_GGA(X1, X2, X3, X4, X5, shuffleA_in_gga(.(X1, X2), X4, X5))
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → SHUFFLEA_IN_GGA(.(X1, X2), X4, X5)
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, .(X1, X5))) → U5_GGA(X1, X2, X3, X4, X5, shuffleA_in_gga(X2, X4, X5))
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, .(X1, X5))) → SHUFFLEA_IN_GGA(X2, X4, X5)
SHUFFLEA_IN_GGA(X1, .(X2, .(X3, X4)), .(X2, .(X3, X5))) → U6_GGA(X1, X2, X3, X4, X5, shuffleA_in_gga(X1, X4, X5))
SHUFFLEA_IN_GGA(X1, .(X2, .(X3, X4)), .(X2, .(X3, X5))) → SHUFFLEA_IN_GGA(X1, X4, X5)
R is empty.
The argument filtering Pi contains the following mapping:
shuffleA_in_gga(
x1,
x2,
x3) =
shuffleA_in_gga(
x1,
x2)
.(
x1,
x2) =
.(
x1,
x2)
[] =
[]
SHUFFLEA_IN_GGA(
x1,
x2,
x3) =
SHUFFLEA_IN_GGA(
x1,
x2)
U1_GGA(
x1,
x2,
x3,
x4,
x5) =
U1_GGA(
x1,
x2,
x3,
x5)
U2_GGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U2_GGA(
x1,
x2,
x3,
x4,
x6)
U3_GGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U3_GGA(
x1,
x2,
x3,
x4,
x6)
U4_GGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U4_GGA(
x1,
x2,
x3,
x4,
x6)
U5_GGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U5_GGA(
x1,
x2,
x3,
x4,
x6)
U6_GGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U6_GGA(
x1,
x2,
x3,
x4,
x6)
We have to consider all (P,R,Pi)-chains
Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES
(4) Obligation:
Pi DP problem:
The TRS P consists of the following rules:
SHUFFLEA_IN_GGA(.(X1, []), .(X2, X3), .(X2, X4)) → U1_GGA(X1, X2, X3, X4, shuffleA_in_gga(.(X1, []), X3, X4))
SHUFFLEA_IN_GGA(.(X1, []), .(X2, X3), .(X2, X4)) → SHUFFLEA_IN_GGA(.(X1, []), X3, X4)
SHUFFLEA_IN_GGA(.(X1, .(X2, X3)), X4, .(X1, .(X2, X5))) → U2_GGA(X1, X2, X3, X4, X5, shuffleA_in_gga(X3, X4, X5))
SHUFFLEA_IN_GGA(.(X1, .(X2, X3)), X4, .(X1, .(X2, X5))) → SHUFFLEA_IN_GGA(X3, X4, X5)
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X1, .(X3, X5))) → U3_GGA(X1, X2, X3, X4, X5, shuffleA_in_gga(X2, X4, X5))
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X1, .(X3, X5))) → SHUFFLEA_IN_GGA(X2, X4, X5)
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → U4_GGA(X1, X2, X3, X4, X5, shuffleA_in_gga(.(X1, X2), X4, X5))
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → SHUFFLEA_IN_GGA(.(X1, X2), X4, X5)
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, .(X1, X5))) → U5_GGA(X1, X2, X3, X4, X5, shuffleA_in_gga(X2, X4, X5))
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, .(X1, X5))) → SHUFFLEA_IN_GGA(X2, X4, X5)
SHUFFLEA_IN_GGA(X1, .(X2, .(X3, X4)), .(X2, .(X3, X5))) → U6_GGA(X1, X2, X3, X4, X5, shuffleA_in_gga(X1, X4, X5))
SHUFFLEA_IN_GGA(X1, .(X2, .(X3, X4)), .(X2, .(X3, X5))) → SHUFFLEA_IN_GGA(X1, X4, X5)
R is empty.
The argument filtering Pi contains the following mapping:
shuffleA_in_gga(
x1,
x2,
x3) =
shuffleA_in_gga(
x1,
x2)
.(
x1,
x2) =
.(
x1,
x2)
[] =
[]
SHUFFLEA_IN_GGA(
x1,
x2,
x3) =
SHUFFLEA_IN_GGA(
x1,
x2)
U1_GGA(
x1,
x2,
x3,
x4,
x5) =
U1_GGA(
x1,
x2,
x3,
x5)
U2_GGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U2_GGA(
x1,
x2,
x3,
x4,
x6)
U3_GGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U3_GGA(
x1,
x2,
x3,
x4,
x6)
U4_GGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U4_GGA(
x1,
x2,
x3,
x4,
x6)
U5_GGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U5_GGA(
x1,
x2,
x3,
x4,
x6)
U6_GGA(
x1,
x2,
x3,
x4,
x5,
x6) =
U6_GGA(
x1,
x2,
x3,
x4,
x6)
We have to consider all (P,R,Pi)-chains
(5) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LOPSTR] contains 1 SCC with 6 less nodes.
(6) Obligation:
Pi DP problem:
The TRS P consists of the following rules:
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X1, .(X3, X5))) → SHUFFLEA_IN_GGA(X2, X4, X5)
SHUFFLEA_IN_GGA(.(X1, []), .(X2, X3), .(X2, X4)) → SHUFFLEA_IN_GGA(.(X1, []), X3, X4)
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → SHUFFLEA_IN_GGA(.(X1, X2), X4, X5)
SHUFFLEA_IN_GGA(.(X1, .(X2, X3)), X4, .(X1, .(X2, X5))) → SHUFFLEA_IN_GGA(X3, X4, X5)
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, .(X1, X5))) → SHUFFLEA_IN_GGA(X2, X4, X5)
SHUFFLEA_IN_GGA(X1, .(X2, .(X3, X4)), .(X2, .(X3, X5))) → SHUFFLEA_IN_GGA(X1, X4, X5)
R is empty.
The argument filtering Pi contains the following mapping:
.(
x1,
x2) =
.(
x1,
x2)
[] =
[]
SHUFFLEA_IN_GGA(
x1,
x2,
x3) =
SHUFFLEA_IN_GGA(
x1,
x2)
We have to consider all (P,R,Pi)-chains
(7) PiDPToQDPProof (SOUND transformation)
Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.
(8) Obligation:
Q DP problem:
The TRS P consists of the following rules:
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4)) → SHUFFLEA_IN_GGA(X2, X4)
SHUFFLEA_IN_GGA(.(X1, []), .(X2, X3)) → SHUFFLEA_IN_GGA(.(X1, []), X3)
SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4)) → SHUFFLEA_IN_GGA(.(X1, X2), X4)
SHUFFLEA_IN_GGA(.(X1, .(X2, X3)), X4) → SHUFFLEA_IN_GGA(X3, X4)
SHUFFLEA_IN_GGA(X1, .(X2, .(X3, X4))) → SHUFFLEA_IN_GGA(X1, X4)
R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
(9) QDPSizeChangeProof (EQUIVALENT transformation)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.
From the DPs we obtained the following set of size-change graphs:
- SHUFFLEA_IN_GGA(.(X1, .(X2, X3)), X4) → SHUFFLEA_IN_GGA(X3, X4)
The graph contains the following edges 1 > 1, 2 >= 2
- SHUFFLEA_IN_GGA(.(X1, []), .(X2, X3)) → SHUFFLEA_IN_GGA(.(X1, []), X3)
The graph contains the following edges 1 >= 1, 2 > 2
- SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4)) → SHUFFLEA_IN_GGA(X2, X4)
The graph contains the following edges 1 > 1, 2 > 2
- SHUFFLEA_IN_GGA(.(X1, X2), .(X3, X4)) → SHUFFLEA_IN_GGA(.(X1, X2), X4)
The graph contains the following edges 1 >= 1, 2 > 2
- SHUFFLEA_IN_GGA(X1, .(X2, .(X3, X4))) → SHUFFLEA_IN_GGA(X1, X4)
The graph contains the following edges 1 >= 1, 2 > 2
(10) YES